PriorityQueue

A wrapper around BinaryHeap Sorts a set of items based upon a priority

deprecated

struct PriorityQueue (

T

U = ubyte

) {

struct PriorityQueueItem;

BinaryHeap!(PriorityQueueItem, `a.priority < b.priority`) elements;

void put(T item, U priority);

}

Alias This

Members

Functions

get U get(): Gets the front item (FIFO) of the queue
put void put(T item, U priority): Adds an item to the queue

Structs

PriorityQueueItem struct PriorityQueueItem: Undocumented in source.

Variables

elements BinaryHeap!(PriorityQueueItem, `a.priority < b.priority`) elements;: Undocumented in source.

Parameters

T: The queue item type
U: The priority type

See Also

std.collections.binaryheap.BinaryHeap

Meta

Source

See Implementation

devisualization util algorithms pathfinding defs functions

structs

variables

DIAGRAM1_WALLS